Abstraction Tree Indexing for Terms
نویسنده
چکیده
An indexing technique for first-order predicate logic terms and literals is proposed. It exploits the lattice structure of terms, generated by the usual instance relation, to provide for a given “query term” fast access to all T-unifiable terms, T-instances (backward subsumption) and T-generalized terms (forward subsumption) where T is any finitary unification theory. In the best case one single unification or matching operation respectively is sufficient to access a large number of unifiable terms or instances at once.
منابع مشابه
Substitution Tree Indexing
The performance of a theorem prover crucially depends on the speed of the basic retrieval operations, such as finding terms that are unifiable with (instances of, or more general than) a given query term. In this paper a new indexing method is presented, which outperforms traditional methods such as path indexing, discrimination tree indexing and abstraction trees. Additionally, the new index n...
متن کاملOut From Under the Trees With T2SM
For some time, most research on the low-level data organization and indexing of data has focused on the construction of hierarchical, disk-block based file organizations. Most of these proposed organizations are variations on, or additions to, fundamental ideas taken from early indexing structures like the B-tree and R-tree. In this paper, we question whether the continued reliance on block-bas...
متن کاملPath Indexing for Term Retrieval
Different methods for term retrieval in deduction systems have been introduced in literature. This report reviews the three indexing techniques discrimination indexing, path indexing, and abstraction tree indexing. A formal approach to path indexing is presented and algorithms as well as data structures of an existing implementation are discussed. Eventually, experiments will show that our impl...
متن کاملمدل دو مرحله ای شکاف- گلچین برای نمایه سازی خودکار متون فارسی
Purpose: Each language has its own problems. This leads to consider appropriate models for automatic indexing of every language. These models should concern the exhaustificity and specificity of indexing. This paper aims at introduction and evaluation of a model which is suited for Persian automatic indexing. This model suggests to break the text into the particles of candidate terms and to c...
متن کاملامکانسنجی طرح تدوین اصطلاح نامۀ مطالعات زنان و خانواده براساس استاندارد BS ISO 25964-1
Research Objective: Feasibility study of the Family and Women’s Studies Thesaurus considering the expansion of information in the field of women and family studies, as well as the wide span of related vocabulary and the development of vocabulary lists and bibliographies, the Family and Women’s Studies Thesaurus can be a professional tool for indexing and retrieval of women’s information in data...
متن کامل